A Hamiltonian decomposition of K2m∗, 2m ≥ 8
نویسندگان
چکیده
منابع مشابه
Hamiltonian Decomposition of Recursive
We show that recursive circulant G(cd m ; d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circula...
متن کاملA Hamiltonian Decomposition of 5-star
Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoi...
متن کاملHamiltonian Decomposition of the Hypercube
We consider the problem of Hamiltonian decomposition on the hypercube. It is known that there exist bn=2c edge-disjoint Hamiltonian cycles on a binary n-cube. However, there are still no simple algorithms to construct such cycles. We present some promising results that may lead to a very simple method to obtain the Hamiltonian decomposition. The binary n-cube is equivalent to the Cartesian prod...
متن کاملMulticolored parallelisms of Hamiltonian cycles
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m + 1 vertices K2m+1 can be properly edge-colored with 2m+ 1 colors in such a way that the edges of K2m+1 can be partitioned intommulticolored Hamiltonian cycles. © 2009 Published by Elsevier B.V.
متن کاملHamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N − 1}, with {v; w} an edge if v − w ≡ ±di(modN ) for some 06i6dlogd Ne − 1. We show that the circulant graph G(cd; d) is Hamilton decomposable for all positive integers c; d, and m with c¡d. This extends work of Micheneau and answers a special case of a question of Alspach. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1980
ISSN: 0095-8956
DOI: 10.1016/0095-8956(80)90044-1